Opening time by degrees

Collapsing Polynomial-Time Degrees

For reducibilities r and r′ such that r is weaker than r′, we say that the r-degree of A, i.e., the class of sets which are r-equivalent to A, collapses to the r′-degree of A if both degrees coincide. We investigate for the polynomial-time bounded many-one, bounded truth-table, truth-table, and Turing reducibilities whether and under which conditions such collapses can occur. While we show that...

Analyzing graphs by degrees

Let G = (V, E) be a graph and let N(v) = {u : uv ∈ E} be the open neighborhood of a vertex v ∈ V . The degree of v, deg(v) = |N(v)|, equals the number of vertices u that are adjacent to v. By considering the relationships between deg(v) and the degrees deg(u), for every u ∈ N(v), we define 10 types of vertices and study some of their properties.

Time-frequency analysis of the glottal opening

Wolfgang Wokurek Institut f ur Maschinelle Sprachverarbeitung Universit at Stuttgart, Azenbergstra e 12, 70174 Stuttgart, Germany [email protected] ABSTRACT Simultaneous recordings of the laryngograph signal and speech recorded in an non-reverberating environment are investigated for acoustic evidence of the glottal opening within the microphone signal. It is demonstrated that the ...

Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals

We characterise explicitly the decidable predicates on integers of Innnite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down , the least ordinal not the length of any eventual output of an Innnite Time Turing machine (halting or otherwise); using this the Innnite Time Turing Degrees are considered, and it is shown how the jump ope...

Opening the Time Domain at Keck